On optimal step-length gradient eigensolvers

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convergence Estimates for Preconditioned Gradient Subspace Iteration Eigensolvers

Subspace iteration for computing several eigenpairs (i.e. eigenvalues and eigenvectors) of an eigenvalue problem is an alternative to the deflation technique whereby the eigenpairs are computed successively by projecting the problem onto the subspace orthogonal to the already found eigenvectors. The main advantage of the subspace iteration over the deflation is its ‘cluster robustness’: even if...

متن کامل

Gradient Flow Approach to Geometric Convergence Analysis of Preconditioned Eigensolvers

Preconditioned eigenvalue solvers (eigensolvers) are gaining popularity, but their convergence theory remains sparse and complex. We consider the simplest preconditioned eigensolver— the gradient iterative method with a fixed step size—for symmetric generalized eigenvalue problems, where we use the gradient of the Rayleigh quotient as an optimization direction. A sharp convergence rate bound fo...

متن کامل

Evaluation of optimal step length in a seven-link model with margin of stability method

In a walking cycle design, maximizing the upright balance should be considered in addition to the kinematic constraints, energy consumption rate must be considered. The purpose of this study is to find the optimal step length obtained for each person according to the physical features. In this research, in order to minimize energy consumption rate by considering maximum balance two cost functio...

متن کامل

On Parallelizable Eigensolvers

In this paper, we show how the intimate relationship between a certain matrix algebra and the ring of complex polynomials suggests a strategy for devising new parallel algorithms for the eigenproblem with a twofold potential for parallelism. Speciically, we explore the algorithmic implications of the fact that an ability to compute nontrivial invariant subspaces of a matrix M results in an abil...

متن کامل

Optimal walking in terms of variability in step length.

The optimal condition in speed, step rate, and step length of human walking has been reported in terms of temporal consistency, energy cost, and attentional demand. No study, however, has been conducted on the optimal condition in terms of spatial variability of walking. This study examined whether there is an optimal walking speed with minimum intrasubject variability in step length and step w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: PAMM

سال: 2011

ISSN: 1617-7061

DOI: 10.1002/pamm.201110364